A Quantifier Scoping Algorithm without A Free Variable Constraint
نویسنده
چکیده
Three recent demands on quantifier scoping algorithms have been that they should be explicitly stated, they should be sound and complete with respect to the input sentence [Hobbs and Shieber 1987] and they should not employ a 'Free Variable Constraint' [Pereira 1989]. The first demand is for good academic practice. The second is to ask for an algorithm that generates all and only the possible scopings of a sentence. The third demand is for an algorithm that avoids appealing to the syntax of logical form in order to determine possible scopings. I present a modified version of [Hobbs and Shieber 1987], which simplifies its operation, and can be considered sound and complete, depending on what interpretations of English sentences are deemed possible. Finally, any doubts concerning the use of logical form syntax are avoided.
منابع مشابه
Compositional, Variable Free, Binding Free and Structure Oriented Discourse Interpretation
Our main objective will be to construct a fully compositional representation of nominal anaphora in discourse. The proposed representation is not dependent on the remote ascription (i.e. done outside the formal representation) of syntactic indexes, which identify anaphoric links. A formal language of variable free logic is introduced. It is based on dynamic semantics paradigm and is a variant o...
متن کاملParsing Parallel Grammatical Representations
~:aditional accounts of quantifier scope employ qualitative constraints or rules to account for scoping preferences. This paper outlines a feature-based parsing algorithm for a grammar with multiple simultaneous levels of representation, one of which corresponds to a partial ordering among quantifiers according to scope. The optimal such ordering (as well as the ranking of other orderings) is d...
متن کاملAn Algorithm For Generating Non-Redundant Quantifier Scopings
This paper describes an algorithm for generating quantifier scopings. The algorithm is designed to generate only logically non-redundant scopings and to partially order the scopings with a given :default scoping first. Removing logical redundancy is not only interesting per se, but also drastically reduces the processing time. The input and output formats are described through a few access and ...
متن کاملSkolemization Modulo Theories
Combining classical automated theorem proving techniques with theory based reasoning, such as satisfiability modulo theories, is a new approach to first-order reasoning modulo theories. Skolemization is a classical technique used to transform first-order formulas into equisatisfiable form. We show how Skolemization can benefit from a new satisfiability modulo theories based simplification techn...
متن کاملDeciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) integer-valued state variables, such as pipelined processor designs and timed systems. In this paper, we present a fast decision procedure for separation logic, which combines Boolean satisfiability (SAT) with a graph based ...
متن کامل